#include <iostream>
#include <algorithm>
#include <string>
#include <set>
#include <vector>
//#define int unsigned long long
#define int long long
#define all(x) x.begin(), x.end()
using namespace std;

void solve()
{
	int n; cin >> n;
	int cnt_lower = 0, max_lower = INT_MIN, ans = 0;
	for (int i = 0; i < n; ++i)
	{
		int tmp; cin >> tmp;
		//cout << "tmp = " << tmp << endl;
		if (tmp == 0) ans++;
		else if (tmp < 0)
		{
			max_lower = max(max_lower, tmp);
			cnt_lower++;
		}
	}
	//cout << "cnt : " << cnt_lower << endl;
	if (cnt_lower % 2 == 1)
	{
		//cout << (-1 * max_lower + 1) << '-';
		ans += -1 * max_lower + 1;
	}
	cout << ans << endl;
}

signed main()
{
	int t; cin >> t;
	while (t--) solve();
	return 0;
}

//3 3 -1 0 1 4 -1 -1 0 1 5 -1 -1 -1 0 0
